Reachability Oracles for Directed Transmission Graphs
نویسندگان
چکیده
منابع مشابه
Reachability Oracles for Directed Transmission Graphs
Let P ⊂ R be a set of n points in the d dimensions such that each point p ∈ P has an associated radius rp > 0. The transmission graph G for P is the directed graph with vertex set P such that there is an edge from p to q if and only if d(p, q) ≤ rp, for any p, q ∈ P . A reachability oracle is a data structure that decides for any two vertices p, q ∈ G whether G has a path from p to q. The quali...
متن کاملSpanners and Reachability Oracles for Directed Transmission Graphs
Let P ⊂ R be a set of n points, each with an associated radius rp > 0. The transmission graph G for P has vertex set P and an edge from p to q if and only if q lies in the ball with radius rp around p. Let t > 1. A t-spanner H for G is a sparse subgraph of G such that for any two vertices p, q connected by a path of length ` in G, there is a p-q-path of length at most t` in H. We show how to co...
متن کاملReachability Oracles for Disk Transmission Graphs
Let P ⊆ R be a set of n points, each with an associated radius rp > 0. This induces a directed graph on P with an edge from p to q if and only if q lies in the ball with radius rp around p. We show that for d = 1 there is a data structure that answers reachability queries (given two vertices, is there a directed path between them?) in time O(1) using O(n) space and O(n log n) preprocessing time...
متن کاملFault Tolerant Reachability for Directed Graphs
Let G = (V,E) be an n-vertices m-edges directed graph. Let s ∈ V be any designated source vertex, and let T be an arbitrary reachability tree rooted at s. We address the problem of finding a set of edges E ⊆ E\T of minimum size such that on a failure of any vertex w ∈ V , the set of vertices reachable from s in T ∪ E\{w} is the same as the set of vertices reachable from s in G\{w}. We obtain th...
متن کاملImproved Dynamic Reachability Algorithms for Directed Graphs
We obtain several new dynamic algorithms for maintaining the transitive closure of a directed graph and several other algorithms for answering reachability queries without explicitly maintaining a transitive closure matrix. Among our algorithms are: (i) A decremental algorithm for maintaining the transitive closure of a directed graph, through an arbitrary sequence of edge deletions, in O(mn) t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-019-00641-1